A DTD Complexity Metric
نویسندگان
چکیده
In this paper, we propose a metric for measuring the complexity of a DTD. For the same purpose, different designers may create different DTDs. A complexity metric can assist us to evaluate and compare their different merits. Through the recognition of strongly connected components, the metric accommodates the recursive relationship of elements in a DTD. The metric presented here can be expressed in a simple and informal way involving the number of elements, connectors, appearance indicators and back edges.
منابع مشابه
Document Type Definition (DTD) Metrics
In this paper, we present two complexity metrics for the assessment of schema quality written in Document Type Definition (DTD) language. Both “Entropy (E) metric: E(DTD)” and “Distinct Structured Element Repetition Scale (DSERS) metric: DSERS(DTD)” are intended to measure the structural complexity of schemas in DTD language. These metrics exploit a directed graph representation of schema docum...
متن کاملImproving Success Ratio in Multi-Constraint Quality of Service Routing
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
متن کاملEnhancing Semistructured Data Mediators with Document Type Definitions
Mediation is an important application of XML. The MIX mediator uses Document Type De nitions (DTDs) to assist the user in query formulation and query processors in running queries more e ciently. We provide an algorithm for inferring the view DTD from the view de nition and the source DTDs. We develop a metric of the quality of the inference algorithm's view DTD by formalizing the notions of so...
متن کاملAn objective technique for evaluating doubletalk detectors in acoustic echo cancelers
Echo cancelers commonly employ a doubletalk detector (DTD), which is essential to keep the adaptive filter from diverging in the presence of near-end speech and other disruptive noise. There have been numerous algorithms to detect doubletalk in an acoustic echo canceler (AEC). In those applications, typically, the threshold is chosen only by some heuristic method and the performance evaluation ...
متن کاملAn XML Document Transformation Algorithm Inferred from an Edit Script between DTDs
Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an edit script between original and updated DTDs is available, we consider inferring a transformation algorithm, which transforms each document valid against the original DTD into a document valid against the updated DTD, from the original DTD and the edit script. We first ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003